A family of mixed graphs with large order and diameter 2
نویسندگان
چکیده
منابع مشابه
Diameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کاملA construction of dense mixed graphs of diameter 2
A mixed graph is said to be dense, if its order is close to the Moore bound and it is optimal if there is not a mixed graph with the same parameters and bigger order. We give a construction that provides dense mixed graphs of undirected degree q, directed degree q−1 2 and order 2q 2, for q being an odd prime power. Since the Moore bound for a mixed graph with these parameters is equal to 9q 2−4...
متن کاملdiameter two graphs of minimum order with given degree set
the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...
متن کاملa comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولOn a Family of 4-Critical Graphs with Diameter Three
Let γt(G) denote the total domination number of the graph G. G is said to be total domination edge critical, or simply γt-critical, if γt(G+ e) < γt(G) for each edge e ∈ E(G). In this paper we study a family H of 4-critical graphs with diameter three, in which every vertex is a diametrical vertex, and every diametrical pair dominates the graph. We also generalize the self-complementary graphs, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2016.09.034